Improved Fuzzy Art Method for Initializing K-means
نویسندگان
چکیده
منابع مشابه
Improved Fuzzy Art Method for Initializing K-means
The K-means algorithm is quite sensitive to the cluster centers selected initially and can perform different clusterings depending on these initialization conditions. Within the scope of this study, a new method based on the Fuzzy ART algorithm which is called Improved Fuzzy ART (IFART) is used in the determination of initial cluster centers. By using IFART, better quality clusters are achieved...
متن کاملFuzzy reasoning in K-means classification method
Domain analysis tries to reuse software in an e ective way New methodologies are start ing to be able to automate the process in di erent degrees with the construction of a domain model for each problem The general process is divided into several phases One of the most di cult tasks is the generation of the relationships which have to be de ned between the components in the domain In this paper...
متن کاملA Minimum Spanning Tree-Based Method for Initializing the K-Means Clustering Algorithm
Abstract—The traditional k-means algorithm has been widely used as a simple and efficient clustering method. However, the algorithm often converges to local minima for the reason that it is sensitive to the initial cluster centers. In this paper, an algorithm for selecting initial cluster centers on the basis of minimum spanning tree (MST) is presented. The set of vertices in MST with same degr...
متن کاملAn Improved K-Means with Artificial Bee Colony Algorithm for Clustering Crimes
Crime detection is one of the major issues in the field of criminology. In fact, criminology includes knowing the details of a crime and its intangible relations with the offender. In spite of the enormous amount of data on offenses and offenders, and the complex and intangible semantic relationships between this information, criminology has become one of the most important areas in the field o...
متن کاملImproved Performance of Unsupervised Method by Renovated K-Means
Clustering is a separation of data into groups of similar objects. Every group called cluster consists of objects that are similar to one another and dissimilar to objects of other groups. In this paper, the K-Means algorithm is implemented by three distance functions and to identify the optimal distance function for clustering methods. The proposed K-Means algorithm is compared with K-Means, S...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computational Intelligence Systems
سال: 2010
ISSN: 1875-6891,1875-6883
DOI: 10.1080/18756891.2010.9727698